Automated Transplantation of Call Graph and Layout Features into Kate

نویسندگان

  • Alexandru Marginean
  • Earl T. Barr
  • Mark Harman
  • Yue Jia
چکیده

We report the automated transplantation of two features currently missing from Kate: call graph generation and automatic layout for C programs, which have been requested by users on the Kate development forum. Our approach uses a lightweight annotation system with Search Based techniques augmented by static analysis for automated transplanting. The results are promising: on average, our tool requires 101 minutes of standard desktop machine time to transplant the call graph feature, and 31 minutes to transplant the layout feature. We repeated each experiment 20 times and validated the resulting transplants using unit, regression and acceptance test suites. In 34 of 40 experiments conducted our search-based autotransplantation tool, μSCALPEL, was able to successfully transplant the new functionality, passing all tests.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ant Colony Algorithm for the Single Loop Routing Problem

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

متن کامل

Ant Colony Algorithm for the Single Loop Routing Problem

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

متن کامل

Graph layout using subgraph isomorphisms

Today, graphs are used for many things. In engineering, graphs are used to design circuits in very large scale integration. In computer science, graphs are used in the representation of the structure of software. They show information such as the flow of data through the program (known as the data flow graph [1]) or the information about the calling sequence of programs (known as the call graph...

متن کامل

Edge Labeling in the Graph Layout Toolkit

The Graph Layout Toolkit is a family of portable graph drawing and layout libraries designed for integration into graphical user interface application programs. When visualizing graphs, it becomes essential to communicate the meaning of each graphical feature via text labels. We present the interface and the basic engine of the Graph Layout Toolkit that produce a high quality automated placemen...

متن کامل

A Mathematical Model for Multiple-Load AGVs in Tandem Layout

Reducing cost of material handling has been a big challenge for companies. Flexible manufacturing system employed automated guided vehicles (AGV) to maintain efficiency and flexibility. This paper presents a new non-linear mathematical programming model to group n machines into N loops, to make an efficient configuration for AGV system in Tandem layout. The model minimizes bot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015